Learnability with respect to fixed distributions

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Fixed Points Theorems with respect to \fuzzy w-distance

In this paper, we shall introduce the fuzzyw-distance, then prove a common fixed point theorem with respectto fuzzy w-distance for two mappings under the condition ofweakly compatible in complete fuzzy metric spaces.

متن کامل

a comparison of teachers and supervisors, with respect to teacher efficacy and reflection

supervisors play an undeniable role in training teachers, before starting their professional experience by preparing them, at the initial years of their teaching by checking their work within the proper framework, and later on during their teaching by assessing their progress. but surprisingly, exploring their attributes, professional demands, and qualifications has remained a neglected theme i...

15 صفحه اول

fixed points theorems with respect to fuzzy w-distance

in this paper, we shall introduce the fuzzyw-distance, then prove a common fixed point theorem with respectto fuzzy w-distance for two mappings under the condition ofweakly compatible in complete fuzzy metric spaces.

متن کامل

Multiple Pattern Avoidance with respect to Fixed Points and Excedances

We study the distribution of the statistics ‘number of fixed points’ and ‘number of excedances’ in permutations avoiding subsets of patterns of length 3. We solve all the cases of simultaneous avoidance of more than one pattern, giving generating functions enumerating these two statistics. Some cases are generalized to patterns of arbitrary length. For avoidance of one single pattern we give pa...

متن کامل

Polynomial Learnability of Stochastic Rules with Respect to the KL-Divergence and Quadratic Distance

We consider the problem of efficient learning of probabilistic concepts (p-concepts) and more generally stochastic rules in the sense defined by Kearns and Schapire [6] and by Yamanishi [18]. Their models extend the PAC-learning model of Valiant [16] to the learning scenario in which the target concept or function is stochastic rather than deterministic as in Valiant’s original model. In this p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 1991

ISSN: 0304-3975

DOI: 10.1016/0304-3975(91)90026-x